Identifiability in phylogenetics using algebraic matroids

Abstract Identifiability is a crucial property for statistical model since distributions in the uniquely determine parameters that produce them. In phylogenetics, identifiability of tree parameter particular interest it means phylogenetic models can be used to infer evolutionary histories from data. this paper we introduce new computational strategy proving discrete algebraic uses matroids naturally associated models. We then use algorithm prove are generically identifiable 2-tree CFN and K3P mixtures. also show k-cycle network under K2P